Strong Normalization and Typability with Intersection Types
نویسنده
چکیده
A simple proof is given of the property that the set of strongly normalizing lambda terms coincides with the set of lambda terms typable in certain intersection type assignment systems.
منابع مشابه
A Resource Aware Computational Interpretation for Herbelin's Syntax
We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin’s syntax a type system based on non-idempotent intersection types, together with a set of reduction rules –inspired from the substitution at a distance paradigm– that preserves (and decreases the size of) typing ...
متن کاملA linearization of the Lambda-calculus and consequences
We embed the standard λ-calculus, denoted Λ, into two larger λ-calculi, denoted Λ∧ and &Λ∧. The standard notion of β-reduction for Λ corresponds to two new notions of reduction, β∧ for Λ∧ and &β∧ for &Λ∧. A distinctive feature of our new calculus Λ∧ (resp., &Λ∧) is that, in every function application, an argument is used at most once (resp., exactly once) in the body of the function. We establi...
متن کاملTypes as Resources for Classical Natural Deduction
We define two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments –based on decreasing measures of type derivations– to characterize head and strongly normalizing terms. Moreover, typability provides upper bounds for the length of head-reduction sequences and maximal redu...
متن کاملOn Mints' Reduction for ccc-Calculus
A formalization of the strong normalization proof for system F in LEGO p. 13 Partial intersection type assignment in applicative term rewriting systems p. 29 Extracting constructive content from classical logic via control-like reductions p. 45 Combining first and higher order rewrite systems with type assignment systems p. 60 A term calculus for intuitionistic linear logic p. 75 Program extrac...
متن کاملRelating Typability and Expressiveness in Finite-Rank Intersection Type Systems
We investigate finite-rank intersection type systems, analyzing the complexity of their type inference problems and their relation to the problem of recognizing semantically equivalent terms. Intersection types allow something of type τ1 ∧ τ2 to be used in some places at type τ1 and in other places at type τ2. A finite-rank intersection type system bounds how deeply the ∧ can appear in type exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 37 شماره
صفحات -
تاریخ انتشار 1996